The general position number of integer lattices

نویسندگان

چکیده

• The general position number of all integer grids is determined. Only very partial results were known earlier, each them required quite some effort to obtain it. main result also implies a lower bound on the multidimensional torus graphs. gp( G ) connected graph cardinality largest set S vertices such that no three pairwise distinct from lie common geodesic. n -dimensional grid P ∞ Cartesian product copies two-way infinite path . It proved if ∈ N , then gp ( = 2 − 1 was earlier only for {1, 2} and partially 3

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer Optimization and Lattices

• Lattices. We will see basic properties of lattices, followed by Minkowski’s Theorem which guarantees that any symmetric convex set with volume bigger than 2 must have an non-zero integer point. We will show an application of Minkowski’s theorem to Diophantine approximations. Then we will introduce the powerful concept of Lattice basis reduction which finds an almost orthogonal basis for a lat...

متن کامل

the relationship between academic self-concept and academic achievement in english and general subjects of the students of high school

according to research, academic self-concept and academic achievement are mutually interdependent. in the present study, the aim was to determine the relationship between the academic self-concept and the academic achievement of students in english as a foreign language and general subjects. the participants were 320 students studying in 4th grade of high school in three cities of noor, nowshah...

Camera Placement in Integer Lattices

The camera placement problem concerns the placement of a xed number of point-cameras on the integer lattice of d-tuples of integers in order to maximize their visibility. We give a caracterization of optimal conng-urations of size s less than 5 d and use it to compute in time O(s log s) an optimal abstract connguration under the assumption that the visibility of a connguration is computable in ...

متن کامل

A characterization of multiwavelet packets on general lattices

The objective of this paper is to establish a complete characterization of multiwavelet packets associated with matrix dilation on general lattices $Gamma$ in $mathbb R^d$ by virtue of time-frequency analysis, matrix theory and operator theory.

متن کامل

BOOK OF ABSTRACTS Isoperimetry in integer lattices

The edge isoperimetric problem for a graph G is to determine, for each n, the minimum number of edges leaving any set of n vertices. Exact solutions are known only in special cases, for example when G is the usual integer lattice. The most natural open problem was to answer this question for the ‘strong lattice’, with edges between points at l∞ distance 1. Whilst studying this question we in fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Computation

سال: 2021

ISSN: ['1873-5649', '0096-3003']

DOI: https://doi.org/10.1016/j.amc.2020.125664